Pii: S0360-8352(98)00110-7
نویسندگان
چکیده
A critical problem in decision analysis is how to evaluate the dierence between two or more dierent rankings of a set of alternatives. In this paper it is assumed that a group of decision makers has already established a ranking for each one of a set of alternatives. Then, the problem examined here is how to evaluate the dierences among these rankings. This problem does not have a unique solution and thus we consider a number of alternative approaches. The analysis presented here illustrates that this problem is not trivial and, moreover, it is associated with some counter-intuitive issues. # 1999 Elsevier Science Ltd. All rights reserved.
منابع مشابه
Pii: S0360-8352(98)00105-3
ÐWe consider the problem of scheduling n identical jobs with unequal ready times on m parallel uniform machines to minimize the maximum lateness. This paper develops a branch-and-bound procedure that optimally solves the problem and introduces six simple single-pass heuristic procedures that approximate the optimal solution. The branch-and-bound procedure uses the heuristics to establish an ini...
متن کاملPersonnel assignment problem with hierarchical ordering constraints
Personnel assignment problem with hierarchical ordering constraints Hartford buffalo college essay easy way to write research paper apa format bibliography or works cited. Personnel assignment problem with hierarchical ordering constraints State of California ofac report car purchase Columbus, Abbotsford, Providence, nursing resume template monster Walsall personnel assignment problem with hier...
متن کاملPii: S0360-8352(98)00106-5
A feature-based model is proposed for assembly sequence planning automation. The fundamental assembly modeling strategy for a product is based on the mating features of its components. The objectives of this study are to integrate assembly planning of a product with its CAD model, generate a correct and practical assembly sequence and establish a software system to carry out the planning proces...
متن کاملPii: S0360-8352(99)00086-8
In this paper, a two-stage metaheuristic based on a new neighborhood structure is proposed to solve the vehicle routing problem with time windows. Our neighborhood construction focuses on the relationship between route(s) and node(s). Unlike the conventional methods for parallel route construction, we construct mutes in a nested parallel manner to obtain higher solution quality. Computational r...
متن کاملPii: S0360-8352(02)00181-x
We consider the problem of scheduling a number of jobs on a single machine against a restrictive common due date. The paper consists of two parts: firstly a new and appropriate problem representation is developed. As the restrictive common due date problem is known to be intractable we decided, secondly, to apply meta-heuristics, namely evolutionary strategies, simulated annealing and threshold...
متن کامل